From averaged to simultaneous controllability
نویسندگان
چکیده
منابع مشابه
Averaged controllability of parameter dependent conservative semigroups
We consider the problem of averaged controllability for parameter depending (either in a discrete or continuous fashion) control systems, the aim being to find a control, independent of the unknown parameters, so that the average of the states is controlled. We do it in the context of conservative models, both in an abstract setting and also analysing the specific examples of the wave and Schrö...
متن کاملSimultaneous Exact Controllability and Some Applications
We study the exact controllability of two systems by means of a common finitedimensional input function, a property called simultaneous exact controllability. Most of the time we consider one system to be infinite-dimensional and the other finite-dimensional. In this case we show that if both systems are exactly controllable in time T0 and the generators have no common eigenvalues, then they ar...
متن کاملControllability and simultaneous controllability of isospectral bilinear control systems on complex flag manifolds
For isospectral bilinear control systems evolving on the so-called complex flag manifolds (i.e., on the orbits of the Hermitian matrices under unitary conjugation action) it is shown that controllability is almost always verified. Easy and generic sufficient conditions are provided. The result applies to the problem of density operator controllability of finite dimensional quantum mechanical sy...
متن کاملStructural Controllability of Multi-Agent Networks: Robustness against Simultaneous Failures
In this paper, structural controllability of a leader-follower multi-agent system with multiple leaders is studied from a graph-theoretic point of view. The problem of preservation of structural controllability under simultaneous failures in both the communication links and the agents is investigated. The effects of the loss of agents and communication links on the controllability of an informa...
متن کاملKey to Network Controllability
Liu et. al. recently proposed a minimum number of driver nodes, ND, needed to obtain full structural controllability over a directed network [1]. Driver nodes are unmatched nodes, from which there are directed paths to all matched nodes. Their most important assertion is that a system’s controllability is to a great extent encoded by the underlying network’s degree distribution, P (kin, kout). ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de la faculté des sciences de Toulouse Mathématiques
سال: 2016
ISSN: 0240-2963,2258-7519
DOI: 10.5802/afst.1511